A proof system for graph (non)-isomorphism verification
نویسندگان
چکیده
In order to apply canonical labelling of graphs and isomorphism checking in interactive theorem provers, these algorithms must either be mechanically verified or their results verifiable by independent checkers. We analyze a state-of-the-art algorithm for (described McKay Piperno) formulate it terms formal proof system. provide an implementation that can export the obtained graph is form given graph. Such proofs are then our checker used confirm two not isomorphic.
منابع مشابه
Accelerations for Graph Isomorphism
In this paper, we present two main results. First, by only one conjecture (Conjecture 2.9) for recognizing a vertex symmetric graph, which is the hardest task for our problem, we construct an algorithm for finding an isomorphism between two graphs in polynomial time O(n). Second, without that conjecture, we prove the algorithm to be of quasi-polynomial time O(n ). The conjectures in this paper ...
متن کاملGraph isomorphism models for non interleaving process algebra
Reduction and Topology, p. 28. Non Interleaving Process Algebra, p. 17. Design and Analysis of Dynamic Leader Election Protocols in Broadcast Networks, p. 73. A general conservative extension tbeorem in process algebra, p. 17. Job Shop Scheduling by Constraint Satisfaction, p. 22. A Hierarchical Membership Protocol for Synchronous Distributed Systems, p. 43. Temporal operators viewed as predica...
متن کاملOn Graph Isomorphism for Restricted Graph Classes
Graph isomorphism (GI) is one of the few remaining problems in NP whose complexity status couldn’t be solved by classifying it as being either NP-complete or solvable in P. Nevertheless, efficient (polynomial-time or even NC) algorithms for restricted versions of GI have been found over the last four decades. Depending on the graph class, the design and analysis of algorithms for GI use tools f...
متن کاملScrewBox: a Randomized Certifying Graph-Non-Isomorphism Algorithm
We present a novel randomized approach to the graph isomorphism problem. Our algorithm aims at solving difficult instances by producing randomized certificates for non-isomorphism. We compare our implementation to the de facto standard nauty. On many of the hardest known instances, the incidence graphs of finite projective planes, our program is considerably faster than nauty. However, it is in...
متن کاملGraph Isomorphism
While in general it is not known whether there is a polynomial time algorithm to decide whether two given graphs are isomorphic, there are polynomial-time algorithms for certain subsets of graphs, including but not limited to planar graphs and graphs with bounded valence. In this thesis, we will give a brief introduction on the Graph Isomorphism Problem and its relations to complexity theory. W...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Logical Methods in Computer Science
سال: 2023
ISSN: ['1860-5974']
DOI: https://doi.org/10.46298/lmcs-19(1:9)2023